On processes which cannot be distinguished by finite observation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Processes Which Cannot Be Distinguished by Finitary Observation Yonatan Gutman and Michael Hochman

A function J defined on a family C of stationary processes is finitely observable if there is a sequence of functions sn such that sn(x1 . . . xn) → J(X ) in probability for every process X =(xn) ∈ C. Recently, Ornstein and Weiss proved the striking result that if C is the class of aperiodic ergodic finite valued processes, then the only finitely observable isomorphism invariant defined on C is...

متن کامل

Massless Majorana and Weyl fermions cannot be distinguished

In this note, I will demonstrate that a theory of a massless neutrino (in 3+1-dimensional quantum field theory) can be described either as a theory of a massless Weyl fermion or as a theory of a massless four-component Majorana fermion. The two formulations are indistinguishable, as they arise from exactly the same Lagrangian when expressed in terms of two-component fermions. I will also exhibi...

متن کامل

How words can and cannot be learned by observation.

Three experiments explored how words are learned from hearing them across contexts. Adults watched 40-s videotaped vignettes of parents uttering target words (in sentences) to their infants. Videos were muted except for a beep or nonsense word inserted where each "mystery word" was uttered. Participants were to identify the word. Exp. 1 demonstrated that most (90%) of these natural learning ins...

متن کامل

Envy-free cake divisions cannot be found by finite protocols

We show that no finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.

متن کامل

On Digital Images Which Cannot be Generated by Small Generalised Stochastic Automata

Small Generalised Stochastic Automata Bruce Litow and Olivier de Vel1 Abstract It is known, chie y through the work of Culik and Kari that generalised stochastic automata (GSA) can be used to compress digital (pixel) images. A theoretical account of GSA-based image compression has not been carried out. This paper contributes to such an account by exhibiting a family of images such that a member...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2008

ISSN: 0021-2172,1565-8511

DOI: 10.1007/s11856-008-0029-y